Context-free versus context-dependent constituency relations: A false dichotomy
نویسنده
چکیده
In this paper I articulate a notion of constituency orthogonal both to classical and connectionist approaches. I shall consider three “structure-in-time” connectionist networks (Simple Recurrent Networks, Long Short-Term Memory Models, and Non-classical Connectionist Parsers). I shall argue that explaining compositionality by means of any of these models drives us to an information-processing blind alley. In my view, human combinatorial behaviour must be grounded in sensori-motor activity and the parameter of time. A dynamical notion of constituency will thus be offered.
منابع مشابه
Exocentric (bahuvrīhi) Compounds in Classical Sanskrit
Constituency grammars originated with Leonard Bloomfield (1933) and were developed during the nineteen forties and nineteen fifties by a number of American structuralist linguists, including Harris (1946) and Wells (1947) — to mention just two. In the late nineteen fifties, Chomsky (1957) suggested that constituency grammars could be formalized as context free grammars. It is now clear that con...
متن کاملTransforming a Constituency Treebank into a Dependency Treebank
We present a heuristic technique for converting a constituency treebank into a dependency treebank. In particular, we comment on our experience in converting the Spanish treebank Cast3LB. We extract a context-free grammar from the treebank, automatically identify the head in each rule, and use this information for constructing the dependency tree. Our heuristics have 99% precision and 80% recal...
متن کاملHamiltonian Path in Split Graphs- a Dichotomy
In this paper, we investigate Hamiltonian path problem in the context of split graphs, and produce a dichotomy result on the complexity of the problem. Our main result is a deep investigation of the structure of $K_{1,4}$-free split graphs in the context of Hamiltonian path problem, and as a consequence, we obtain a polynomial-time algorithm to the Hamiltonian path problem in $K_{1,4}$-free spl...
متن کاملContext-Dependent Data Envelopment Analysis-Measuring Attractiveness and Progress with Interval Data
Data envelopment analysis (DEA) is a method for recognizing the efficient frontier of decision making units (DMUs).This paper presents a Context-dependent DEA which uses the interval inputs and outputs. Context-dependent approach with interval inputs and outputs can consider a set of DMUs against the special context. Each context shows an efficient frontier including DMUs in particular l...
متن کاملShift-Reduce Constituency Parsing with Dynamic Programming and POS Tag Lattice
We present the first dynamic programming (DP) algorithm for shift-reduce constituency parsing, which extends the DP idea of Huang and Sagae (2010) to context-free grammars. To alleviate the propagation of errors from part-of-speech tagging, we also extend the parser to take a tag lattice instead of a fixed tag sequence. Experiments on both English and Chinese treebanks show that our DP parser s...
متن کامل